High throughput low-density parity-check decoder architectures
نویسندگان
چکیده
decoders are presented. They are applied to codes with parity-check matrices generated either randomly or using geometric properties of elements in Galois fields. Both decoding schedules have low computational requirements. The original concurrent decoding schedule has a large storage requirement that is dependent on the total number of edges in the underlying bipartite graph, while a new, staggered decoding schedule which uses an approximation of the belief propagation, has a reduced memory requirement that is dependent only on the number of bits in the block. The performance of these decoding schedules is evaluated through simulations on a magnetic recording channel.
منابع مشابه
High-Throughput and Memory Efficient LDPC Decoder Architecture
Low-Density Parity-Check (LDPC) code is one kind of prominent error correcting codes (ECC) being considered in next generation industry standards. The decoder implementation complexity has been the bottleneck of its application. This paper presents a new kind of high-throughput and memory efficient LDPC decoder architecture. In general, more than fifty percent of memory can be saved over conven...
متن کاملAn Fpga Based Overlapped Quasi Cyclic Ldpc Decoder for Wi-max
In this paper, we present a partially parallel Quasi cyclic Low Density Parity Check decoder architecture for WiMAX IEEE 802.16e standard. Two phase message passing Min-sum decoding algorithm is used to decode the Low Density Parity Check codes. The decoder is designed for code rate 1⁄2 and code length of 576 bits and 2304bits. The decoder is easily configurable to support different code length...
متن کاملAREA AND ENERGY EFFICIENT VLSI ARCHITECTURES FOR LOW-DENSITY PARITY-CHECK DECODERS USING AN ON-THE-FLY COMPUTATION A Dissertation by KIRAN
Area and Energy Efficient VLSI Architectures for Low -Density Parity-Check Decoders Using an On-the-Fly Computation. (December 2006) Kiran Kumar Gunnam, M.S., Texas A&M University Co-Chairs of Advisory Committee: Dr. Gwan Choi Dr. Scott Miller The VLSI implementation complexity of a low density parity check (LDPC) decoder is largely influenced by the interconnect and the storage requirements. T...
متن کاملLow-complexity High-speed Quasi-cyclic Ldpc Coded Modulation in Ofdm Wireless Communication System
This paper investigates a Low-Density Parity-Check (LDPC) coded rthogonal Frequency-Division Multiplexing (OFDM) wireless communication system based on IEEE 802.11a standard. This paper studies low-complexity high speed decoder architectures for quasi-cyclic low density parity check (QC-LDPC) codes. Algorithmic transformation and architectural level optimization are incorporated to reduce the c...
متن کاملMemory Efficient Scalable Decoder Architectures for Low Density Parity Check Codes
We present a memory efficient low density parity check (LDPC) decoder that implements a modified Sum Product Algorithm (SPA). A memory efficient implementation for the Min-Sum algorithm is also presented. Serial and scalable partly parallel architectures with both parallel flooding schedule and serial message passing schedule are presented for the regular SPA, modified SPA and Min-Sum algorithm...
متن کاملVLSI Design of a Fully-Parallel High-Throughput Decoder for Turbo Gallager Codes
The most powerful channel coding schemes, namely those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper presents a 2048-bit, rate-1/2 soft decision decoder for a new class of codes known as Turbo Gallager Codes. These...
متن کامل